The Location of the First Ascent in a 123-avoiding Permutation

نویسندگان

  • Samuel Connolly
  • Anant Godbole
چکیده

It is natural to ask, given a permutation with no three-term ascending subsequence, at what index the first ascent occurs. We shall show, using both a recursion and a bijection, that the number of 123-avoiding permutations at which the first ascent occurs at positions k, k + 1 is given by the k-fold Catalan convolution Cn,k. For 1  k  n, Cn,k is also seen to enumerate the number of 123-avoiding permutations with n being in the kth position. Two interesting discrete probability distributions, related obliquely to the Poisson and geometric random variables, are derived as a result.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ascent Sequences Avoiding Pairs of Patterns

Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingŕımsson. In this paper, we consider ascent sequences of length n avoiding two patterns of length 3, and we determine an exact enumeration for 16 different pairs of patterns. Methods include simple recurrences, bijecti...

متن کامل

Ordered partitions avoiding a permutation pattern of length 3

An ordered partition of [n] = {1, 2, . . . , n} is a partition whose blocks are endowed with a linear order. Let OPn,k be the set of ordered partitions of [n] with k blocks and OPn,k(σ) be the set of ordered partitions in OPn,k that avoid a pattern σ. For any permutation pattern σ of length three, Godbole, Goyt, Herdan and Pudwell obtained formulas for the number of ordered partitions of [n] wi...

متن کامل

Permutation Patterns and Continued Fractions

We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to extend this to permutations that have exactly one (132) pattern. We also find some properties of the continued fraction, which is similar to, though more general than, those that were studied by Ramanujan. the electronic ...

متن کامل

The Descent Statistic on 123-avoiding Permutations

We exploit Krattenthaler’s bijection between 123-avoiding permutations and Dyck paths to determine the Eulerian distribution over the set Sn(123) of 123-avoiding permutations in Sn. In particular, we show that the descents of a permutation correspond to valleys and triple ascents of the associated Dyck path. We get the Eulerian numbers of Sn(123) by studying the joint distribution of these two ...

متن کامل

Some enumerative results related to ascent sequences

An ascent sequence is a sequence consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets and a variety of other combinatorial structures. In this paper, we prove some recent conjectures of Duncan and Steingŕımsson concerning pattern avoid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015